Modelling data from different sites, times or studies: weighted vs. unweighted regression
نویسندگان
چکیده
منابع مشابه
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) definition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r − o(1). Then we turn our attention to specific p...
متن کاملFrom Weighted to Unweighted Model Counting
The recent surge of interest in reasoning about probabilistic graphical models has led to the development of various techniques for probabilistic reasoning. Of these, techniques based on weighted model counting are particularly interesting since they can potentially leverage recent advances in unweighted model counting and in propositional satisfiability solving. In this paper, we present a new...
متن کاملArea under Precision-Recall Curves for Weighted and Unweighted Data
Precision-recall curves are highly informative about the performance of binary classifiers, and the area under these curves is a popular scalar performance measure for comparing different classifiers. However, for many applications class labels are not provided with absolute certainty, but with some degree of confidence, often reflected by weights or soft labels assigned to data points. Computi...
متن کاملWeighted and Unweighted Trace Automata
We reprove Droste & Gastin’s characterisation from [3] of the behaviors of weighted trace automata by certain rational expressions. This proof shows how to derive their result on weighted trace automata as a corollary to the unweighted counterpart shown by Ochmański.
متن کاملUnweighted and Weighted Hyper-Minimization
Hyper-minimization of deterministic nite automata (dfa) is a recently introduced state reduction technique that allows a nite change in the recognized language. A generalization of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognized weighted language to di er for nitely many input strings. First, the structure of hyper-minimal determini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methods in Ecology and Evolution
سال: 2011
ISSN: 2041-210X
DOI: 10.1111/j.2041-210x.2011.00140.x